A polyhedral study of lot-sizing with supplier selection
نویسندگان
چکیده
منابع مشابه
Inventory lot-sizing with supplier selection
This paper presents a multi-period inventory lot-sizing scenario, where there are multiple products and multiple suppliers. We consider a situation where the demand of multiple discrete products is known over a planning horizon. Each of these products can be sourced from a set of approved suppliers, a supplier-dependent transaction cost applying for each period in which an order is placed on a ...
متن کاملOn the Polyhedral Structure of Two-Level Lot-Sizing Problems with Supplier Selection
In this paper, we study a two-level lot-sizing problem with supplier selection (LSS). This NP-hard problem arises in different production planning and supply chain management applications. We first present a dynamic programming algorithm for LSS that is polynomial when the number of plants is fixed. We use this algorithm to describe the convex hull of solutions to the problem in an extended spa...
متن کاملInventory lot-sizing with supplier selection using hybrid intelligent algorithm
In supply chain management (SCM), multi-product and multi-period models are usually used to select the suppliers. In the real world of SCM, however, there are normally several echelons which need to be integrated into inventory management. This paper presents a hybrid intelligent algorithm, based on the push SCM, which uses a fuzzy neural network and a genetic algorithm to forecast the rate of ...
متن کاملA Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
In this paper, we study a multi-echelon uncapacitated lot-sizing problem in series (mULS), where the output of the intermediate echelons has its own external demand, and is also an input to the next echelon. We propose a polynomial-time dynamic programming algorithm, which gives a tight, compact extended formulation for the two echelon case (2-ULS). Next, we present a family of valid inequaliti...
متن کاملA polyhedral study of the static probabilistic lot-sizing problem
We study the polyhedral structure of the static probabilistic lot-sizing problem and propose valid inequalities that integrate information from the chance constraint and the binary setup variables. We prove that the proposed inequalities subsume existing inequalities for this problem, and they are facet-defining under certain conditions. In addition, we show that they give the convex hull descr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2012
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2011.09.001